Using Ideas of Kolmogorov Complexity for Studying Biological Texts
نویسندگان
چکیده
منابع مشابه
Kolmogorov Complexity-Based Ideas for Locating Text in Web Images
The gaining popularity of the World Wide Web increases security risks Search tools mon itor plain text in web pages but search for text in graphical images is still di cult For this search we use the fact that the compressed images with text have di erent size than images without text
متن کاملLower Bounds Using Kolmogorov Complexity
In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functions, which gives the complexity of finding a bit where inputs differ, for pairs of inputs that map to different function values. This measure and variants thereof were shown to imply lower bounds for quantum and randomized decis...
متن کاملAverage-Case Analysis Using Kolmogorov Complexity
This expository paper demonstrates how to use Kolmogorov complexity to do the average-case analysis via four examples, and exhibits a surprising property of the celebrated associated universal distribution. The four examples are: average case analysis of Heapsort 17, 15], average nni-distance between two binary rooted leave-labeled trees 20], compact routing in computer networks 3], average-cas...
متن کاملOptimal Representation in Average Using Kolmogorov Complexity
One knows from the Algorithmic Complexity Theory ’ [2-5,8, 141 that a word is incompressible on average. For words of pattern xm, it is natural to believe that providing x and m is an optimal average representation. On the contrary, for words like x @ y (i.e., the bit to bit x or between x and y), providing n and y is not an optimal description on average. In this work, we sketch a theory of av...
متن کاملRecommendation via matrix completion using Kolmogorov complexity
A usual way to model a recommendation system is as a matrix completion problem. There are several matrix completion methods, typically using optimization approaches or collaborative filtering. Most approaches assume that the matrix is either low rank, or that there are a small number of latent variables that encode the full problem. Here, we propose a novel matrix completion algorithm for recom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2012
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-012-9403-6